Generalized Realizability and Basic Logic
نویسندگان
چکیده
Let V be a set of number-theoretical functions. We define notion absolute -realizability for predicate formulas and sequents in such way that the indices functions are used interpreting implication universal quantifier. In this article, we prove Basic Predicate Calculus is sound with respect to semantics if satisfies some natural conditions.
منابع مشابه
Primitive Recursive Realizability and Basic Propositional Logic
Two notions of primitive recursive realizability for arithmetic sentences are considered. The first one is strictly primitive recursive realizability introduced by Z. Damnjanovic in 1994. We prove that intuitionistic predicate logic is not sound with this kind of realizability. Namely there exists an arithmetic sentence which is deducible in the intuitionistic predicate calculus but is not stri...
متن کاملRealizability in classical logic
The essential aim is to explore the Curry-Howard correspondence : we want to associate a program with each mathematical proof and to consider each theorem as a specification, i.e. to find the common behavior of the programs associated with every proof of this theorem. It is a very difficult and very interesting problem, which I call the ‘‘ specification problem ’’ in what follows. In the first ...
متن کاملGeneralized Input/Output Equations and Nonlinear Realizability∗
This work studies various types of input/output representations for analytic input/output operators. It is shown that if an operator satisfies an integro-differential input/output equation or an integral one, then it is locally realizable by analytic state space systems. This generalizes the results previously obtained for differential input/output equations to integral and integro-differential...
متن کاملA Survey of Generalized Basic Logic Al- gebras
Petr Hájek identified the logic BL, that was later shown to be the logic of continuous t-norms on the unit interval, and defined the corresponding algebraic models, BL-algebras, in the context of residuated lattices. The defining characteristics of BL-algebras are representability and divisibility. In this short note we survey recent developments in the study of divisible residuated lattices an...
متن کاملMathematical Logic Well-foundedness in realizability
However, the implication from (1) to (2) is equivalent to the principle of dependent choices (as the reader can show for himself) and cannot be proved in ZF. A relation < on X is called well-founded if any of these statements holds. Intuitionistically, the three statements are far from equivalent (hence, in formalizing an intuitionistic notion of well-foundedness, care is needed). Notion (1) is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computational Logic
سال: 2021
ISSN: ['1557-945X', '1529-3785']
DOI: https://doi.org/10.1145/3468856